0.09/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.11	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.10/0.32	% Computer   : n012.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1200
0.10/0.32	% WCLimit    : 120
0.10/0.32	% DateTime   : Tue Jul 13 12:02:01 EDT 2021
0.10/0.32	% CPUTime    : 
0.10/0.32	% Number of cores: 8
0.10/0.32	% Python version: Python 3.6.8
0.10/0.32	# Version: 2.6rc1-ho
0.10/0.32	# No SInE strategy applied
0.10/0.32	# Trying AutoSched0 for 59 seconds
0.16/0.42	# AutoSched0-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.16/0.42	# and selection function SelectComplexExceptUniqMaxHorn.
0.16/0.42	#
0.16/0.42	# Preprocessing time       : 0.026 s
0.16/0.42	# Presaturation interreduction done
0.16/0.42	
0.16/0.42	# Proof found!
0.16/0.42	# SZS status Theorem
0.16/0.42	# SZS output start CNFRefutation
0.16/0.42	thf(kpairp, axiom, (kpairp<=>![X3:$i, X4:$i]:iskpair @ (kpair @ X3 @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', kpairp)).
0.16/0.42	thf(iskpair, axiom, (iskpair)=(^[X1:$i]:?[X3:$i]:(in @ X3 @ (setunion @ X1)&?[X4:$i]:(in @ X4 @ (setunion @ X1)&(X1)=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', iskpair)).
0.16/0.42	thf(theprop, axiom, (theprop<=>![X5:$i]:(singleton @ X5=>in @ (setunion @ X5) @ X5)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', theprop)).
0.16/0.42	thf(singleton, axiom, (singleton)=(^[X1:$i]:?[X3:$i]:(in @ X3 @ X1&(X1)=(setadjoin @ X3 @ emptyset))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', singleton)).
0.16/0.42	thf(ksndsingleton, axiom, (ksndsingleton<=>![X7:$i]:(iskpair @ X7=>singleton @ (dsetconstr @ (setunion @ X7) @ (^[X3:$i]:(X7)=(kpair @ (kfst @ X7) @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ksndsingleton)).
0.16/0.42	thf(ksndpairEq, conjecture, (dsetconstrER=>(((setukpairinjR=>(ksndsingleton=>![X3:$i, X4:$i]:(ksnd @ (kpair @ X3 @ X4))=(X4)))<=theprop)<=kpairp)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ksndpairEq)).
0.16/0.42	thf(dsetconstrER, axiom, (dsetconstrER<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>X2 @ X3)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', dsetconstrER)).
0.16/0.42	thf(setukpairinjR, axiom, (setukpairinjR<=>![X3:$i, X4:$i, X6:$i, X7:$i]:((kpair @ X3 @ X4)=(kpair @ X6 @ X7)=>(X4)=(X7))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setukpairinjR)).
0.16/0.42	thf(kpair, axiom, (kpair)=(^[X3:$i, X4:$i]:setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', kpair)).
0.16/0.42	thf(ksnd, axiom, (ksnd)=(^[X7:$i]:setunion @ (dsetconstr @ (setunion @ X7) @ (^[X3:$i]:(X7)=(kpair @ (kfst @ X7) @ X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ksnd)).
0.16/0.42	thf(c_0_10, axiom, (kpairp)=(![X3:$i, X4:$i]:?[X21:$i]:(in @ X21 @ (setunion @ (kpair @ X3 @ X4))&?[X22:$i]:(in @ X22 @ (setunion @ (kpair @ X3 @ X4))&(kpair @ X3 @ X4)=(setadjoin @ (setadjoin @ X21 @ emptyset) @ (setadjoin @ (setadjoin @ X21 @ (setadjoin @ X22 @ emptyset)) @ emptyset))))), inference(apply_def,[status(thm)],[kpairp, iskpair])).
0.16/0.42	thf(c_0_11, axiom, (theprop)=(![X5:$i]:(?[X23:$i]:(in @ X23 @ X5&(X5)=(setadjoin @ X23 @ emptyset))=>in @ (setunion @ X5) @ X5)), inference(apply_def,[status(thm)],[theprop, singleton])).
0.16/0.42	thf(c_0_12, axiom, (ksndsingleton)=(![X7:$i]:(?[X24:$i]:(in @ X24 @ (setunion @ X7)&?[X25:$i]:(in @ X25 @ (setunion @ X7)&(X7)=(setadjoin @ (setadjoin @ X24 @ emptyset) @ (setadjoin @ (setadjoin @ X24 @ (setadjoin @ X25 @ emptyset)) @ emptyset))))=>?[X26:$i]:(in @ X26 @ (dsetconstr @ (setunion @ X7) @ (^[X3:$i]:(X7)=(kpair @ (kfst @ X7) @ X3)))&(dsetconstr @ (setunion @ X7) @ (^[X3:$i]:(X7)=(kpair @ (kfst @ X7) @ X3)))=(setadjoin @ X26 @ emptyset)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ksndsingleton, iskpair]), singleton])).
0.16/0.42	thf(c_0_13, plain, ![X27:$i, X7:$i]:(epred1_2 @ X7 @ X27<=>(X7)=(kpair @ (kfst @ X7) @ X27)), introduced(definition)).
0.16/0.42	thf(c_0_14, plain, ![X4:$i, X2:$i > $o]:(epred2_2 @ X2 @ X4<=>X2 @ X4), introduced(definition)).
0.16/0.42	thf(c_0_15, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred2_2 @ X2))=>X2 @ X3)=>(![X3:$i, X4:$i]:?[X21:$i]:(in @ X21 @ (setunion @ (kpair @ X3 @ X4))&?[X22:$i]:(in @ X22 @ (setunion @ (kpair @ X3 @ X4))&(kpair @ X3 @ X4)=(setadjoin @ (setadjoin @ X21 @ emptyset) @ (setadjoin @ (setadjoin @ X21 @ (setadjoin @ X22 @ emptyset)) @ emptyset))))=>(![X5:$i]:(?[X23:$i]:(in @ X23 @ X5&(X5)=(setadjoin @ X23 @ emptyset))=>in @ (setunion @ X5) @ X5)=>(![X3:$i, X4:$i, X6:$i, X7:$i]:((kpair @ X3 @ X4)=(kpair @ X6 @ X7)=>(X4)=(X7))=>(![X7:$i]:(?[X24:$i]:(in @ X24 @ (setunion @ X7)&?[X25:$i]:(in @ X25 @ (setunion @ X7)&(X7)=(setadjoin @ (setadjoin @ X24 @ emptyset) @ (setadjoin @ (setadjoin @ X24 @ (setadjoin @ X25 @ emptyset)) @ emptyset))))=>?[X26:$i]:(in @ X26 @ (dsetconstr @ (setunion @ X7) @ (epred1_2 @ X7))&(dsetconstr @ (setunion @ X7) @ (epred1_2 @ X7))=(setadjoin @ X26 @ emptyset)))=>![X3:$i, X4:$i]:(ksnd @ (kpair @ X3 @ X4))=(X4))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[ksndpairEq]), dsetconstrER]), c_0_10]), c_0_11]), setukpairinjR]), c_0_12]), c_0_13]), c_0_13]), c_0_14])])).
0.16/0.42	thf(c_0_16, plain, ![X3:$i, X4:$i]:(kpair @ X3 @ X4)=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset)), inference(fof_simplification,[status(thm)],[kpair])).
0.16/0.42	thf(c_0_17, negated_conjecture, ![X31:$i, X32:$i > $o, X33:$i, X34:$i, X35:$i, X38:$i, X39:$i, X40:$i, X41:$i, X42:$i, X43:$i, X44:$i, X45:$i, X46:$i]:((~in @ X33 @ (dsetconstr @ X31 @ (epred2_2 @ X32))|X32 @ X33)&((in @ (esk1_2 @ X34 @ X35) @ (setunion @ (kpair @ X34 @ X35))&(in @ (esk2_2 @ X34 @ X35) @ (setunion @ (kpair @ X34 @ X35))&(kpair @ X34 @ X35)=(setadjoin @ (setadjoin @ (esk1_2 @ X34 @ X35) @ emptyset) @ (setadjoin @ (setadjoin @ (esk1_2 @ X34 @ X35) @ (setadjoin @ (esk2_2 @ X34 @ X35) @ emptyset)) @ emptyset))))&((~in @ X39 @ X38|(X38)!=(setadjoin @ X39 @ emptyset)|in @ (setunion @ X38) @ X38)&(((kpair @ X40 @ X41)!=(kpair @ X42 @ X43)|(X41)=(X43))&(((in @ (esk3_1 @ X44) @ (dsetconstr @ (setunion @ X44) @ (epred1_2 @ X44))|(~in @ X45 @ (setunion @ X44)|(~in @ X46 @ (setunion @ X44)|(X44)!=(setadjoin @ (setadjoin @ X45 @ emptyset) @ (setadjoin @ (setadjoin @ X45 @ (setadjoin @ X46 @ emptyset)) @ emptyset)))))&((dsetconstr @ (setunion @ X44) @ (epred1_2 @ X44))=(setadjoin @ (esk3_1 @ X44) @ emptyset)|(~in @ X45 @ (setunion @ X44)|(~in @ X46 @ (setunion @ X44)|(X44)!=(setadjoin @ (setadjoin @ X45 @ emptyset) @ (setadjoin @ (setadjoin @ X45 @ (setadjoin @ X46 @ emptyset)) @ emptyset))))))&(ksnd @ (kpair @ esk4_0 @ esk5_0))!=(esk5_0)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])).
0.16/0.42	thf(c_0_18, plain, ![X28:$i, X29:$i]:(kpair @ X28 @ X29)=(setadjoin @ (setadjoin @ X28 @ emptyset) @ (setadjoin @ (setadjoin @ X28 @ (setadjoin @ X29 @ emptyset)) @ emptyset)), inference(variable_rename,[status(thm)],[c_0_16])).
0.16/0.42	thf(c_0_19, negated_conjecture, ![X1:$i, X3:$i]:(kpair @ X1 @ X3)=(setadjoin @ (setadjoin @ (esk1_2 @ X1 @ X3) @ emptyset) @ (setadjoin @ (setadjoin @ (esk1_2 @ X1 @ X3) @ (setadjoin @ (esk2_2 @ X1 @ X3) @ emptyset)) @ emptyset)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_20, plain, ![X1:$i, X3:$i]:(kpair @ X1 @ X3)=(setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.16/0.42	thf(c_0_21, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((X3)=(X5)|(kpair @ X1 @ X3)!=(kpair @ X4 @ X5)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_22, negated_conjecture, ![X1:$i, X3:$i]:(kpair @ (esk1_2 @ X1 @ X3) @ (esk2_2 @ X1 @ X3))=(kpair @ X1 @ X3), inference(rw,[status(thm)],[c_0_19, c_0_20])).
0.16/0.42	thf(c_0_23, negated_conjecture, ![X1:$i, X3:$i, X5:$i, X4:$i]:((X1)=(esk2_2 @ X3 @ X4)|(kpair @ X5 @ X1)!=(kpair @ X3 @ X4)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.16/0.42	thf(c_0_24, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:((dsetconstr @ (setunion @ X1) @ (epred1_2 @ X1))=(setadjoin @ (esk3_1 @ X1) @ emptyset)|~in @ X3 @ (setunion @ X1)|~in @ X4 @ (setunion @ X1)|(X1)!=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_25, negated_conjecture, ![X1:$i, X3:$i]:in @ (esk2_2 @ X1 @ X3) @ (setunion @ (kpair @ X1 @ X3)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_26, negated_conjecture, ![X1:$i, X3:$i]:(esk2_2 @ X1 @ X3)=(X3), inference(er,[status(thm)],[c_0_23])).
0.16/0.42	thf(c_0_27, negated_conjecture, ![X1:$i, X3:$i]:((dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_2 @ (kpair @ X1 @ X3)))=(setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset)|~in @ X3 @ (setunion @ (kpair @ X1 @ X3))|~in @ X1 @ (setunion @ (kpair @ X1 @ X3))), inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_20])])).
0.16/0.42	thf(c_0_28, negated_conjecture, ![X3:$i, X1:$i]:in @ X1 @ (setunion @ (kpair @ X3 @ X1)), inference(rw,[status(thm)],[c_0_25, c_0_26])).
0.16/0.42	thf(c_0_29, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:(in @ (esk3_1 @ X1) @ (dsetconstr @ (setunion @ X1) @ (epred1_2 @ X1))|~in @ X3 @ (setunion @ X1)|~in @ X4 @ (setunion @ X1)|(X1)!=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_30, negated_conjecture, ![X1:$i, X3:$i]:((dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_2 @ (kpair @ X1 @ X3)))=(setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset)|~in @ X1 @ (setunion @ (kpair @ X1 @ X3))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])])).
0.16/0.42	thf(c_0_31, negated_conjecture, ![X1:$i, X3:$i]:(kpair @ (esk1_2 @ X1 @ X3) @ X3)=(kpair @ X1 @ X3), inference(rw,[status(thm)],[c_0_22, c_0_26])).
0.16/0.42	thf(c_0_32, negated_conjecture, ![X1:$i, X3:$i]:in @ (esk1_2 @ X1 @ X3) @ (setunion @ (kpair @ X1 @ X3)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_33, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(X2 @ X1|~in @ X1 @ (dsetconstr @ X3 @ (epred2_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_34, negated_conjecture, ![X1:$i, X3:$i]:(in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_2 @ (kpair @ X1 @ X3)))|~in @ X3 @ (setunion @ (kpair @ X1 @ X3))|~in @ X1 @ (setunion @ (kpair @ X1 @ X3))), inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_20])])).
0.16/0.42	thf(c_0_35, negated_conjecture, ![X1:$i, X3:$i]:(dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_2 @ (kpair @ X1 @ X3)))=(setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])])).
0.16/0.42	thf(c_0_36, plain, ![X1:$i, X2:$i > $o, X3:$i, X4:$i]:(X2 @ X1|(epred1_2 @ (kpair @ X3 @ X4))!=(epred2_2 @ X2)|~in @ X1 @ (setadjoin @ (esk3_1 @ (kpair @ X3 @ X4)) @ emptyset)|~in @ X3 @ (setunion @ (kpair @ X3 @ X4))), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_33, c_0_30])])).
0.16/0.42	thf(c_0_37, negated_conjecture, ![X1:$i, X3:$i]:(in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset)|~in @ X1 @ (setunion @ (kpair @ X1 @ X3))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35]), c_0_28])])).
0.16/0.42	thf(c_0_38, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i, X4:$i]:(X2 @ X1|(epred1_2 @ (kpair @ X3 @ X4))!=(epred2_2 @ X2)|~in @ X1 @ (setadjoin @ (esk3_1 @ (kpair @ X3 @ X4)) @ emptyset)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_31]), c_0_32])])).
0.16/0.42	thf(c_0_39, negated_conjecture, ![X1:$i, X3:$i]:in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_31]), c_0_32])])).
0.16/0.42	thf(c_0_40, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(X2 @ (esk3_1 @ (kpair @ X1 @ X3))|(epred1_2 @ (kpair @ X1 @ X3))!=(epred2_2 @ X2)), inference(spm,[status(thm)],[c_0_38, c_0_39])).
0.16/0.42	thf(c_0_41, plain, ![X52:$i, X53:$i > $o]:((~epred2_2 @ X53 @ X52|X53 @ X52)&(~X53 @ X52|epred2_2 @ X53 @ X52)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])).
0.16/0.42	thf(c_0_42, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(X2 @ (esk3_1 @ (kpair @ X1 @ X3))|(epred1_2 @ (kpair @ X1 @ X3) @ (esk8_3 @ X2 @ X3 @ X1))!=(epred2_2 @ X2 @ (esk8_3 @ X2 @ X3 @ X1))), inference(neg_ext,[status(thm)],[c_0_40])).
0.16/0.42	thf(c_0_43, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred2_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_41])).
0.16/0.42	thf(c_0_44, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk8_3 @ X2 @ X3 @ X1)|epred2_2 @ X2 @ (esk8_3 @ X2 @ X3 @ X1)|X2 @ (esk3_1 @ (kpair @ X1 @ X3))), inference(dynamic cnf,[status(thm)],[c_0_42])).
0.16/0.42	thf(c_0_45, plain, ![X3:$i, X2:$i > $o, X1:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk8_3 @ X2 @ X3 @ X1)|X2 @ (esk3_1 @ (kpair @ X1 @ X3))|X2 @ (esk8_3 @ X2 @ X3 @ X1)), inference(spm,[status(thm)],[c_0_43, c_0_44])).
0.16/0.42	thf(c_0_46, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(X2 @ (esk3_1 @ (kpair @ X1 @ X3))|~epred1_2 @ (kpair @ X1 @ X3) @ (esk8_3 @ X2 @ X3 @ X1)|~epred2_2 @ X2 @ (esk8_3 @ X2 @ X3 @ X1)), inference(dynamic cnf,[status(thm)],[c_0_42])).
0.16/0.42	thf(c_0_47, plain, ![X1:$i, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk8_3 @ (epred1_2 @ (kpair @ X1 @ X3)) @ X3 @ X1)|epred1_2 @ (kpair @ X1 @ X3) @ (esk3_1 @ (kpair @ X1 @ X3))), inference(ef,[status(thm)],[c_0_45])).
0.16/0.42	thf(c_0_48, plain, ![X50:$i, X51:$i]:((~epred1_2 @ X51 @ X50|(X51)=(kpair @ (kfst @ X51) @ X50))&((X51)!=(kpair @ (kfst @ X51) @ X50)|epred1_2 @ X51 @ X50)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])).
0.16/0.42	thf(c_0_49, negated_conjecture, ![X3:$i, X1:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk3_1 @ (kpair @ X1 @ X3))|~epred2_2 @ (epred1_2 @ (kpair @ X1 @ X3)) @ (esk8_3 @ (epred1_2 @ (kpair @ X1 @ X3)) @ X3 @ X1)), inference(spm,[status(thm)],[c_0_46, c_0_47])).
0.16/0.42	thf(c_0_50, plain, ![X2:$i > $o, X1:$i]:(epred2_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_41])).
0.16/0.42	thf(c_0_51, plain, ![X1:$i, X3:$i]:((X1)=(kpair @ (kfst @ X1) @ X3)|~epred1_2 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_48])).
0.16/0.42	thf(c_0_52, plain, ![X1:$i, X3:$i]:epred1_2 @ (kpair @ X1 @ X3) @ (esk3_1 @ (kpair @ X1 @ X3)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_47])).
0.16/0.42	thf(c_0_53, plain, ![X1:$i, X3:$i]:(kpair @ (kfst @ (kpair @ X1 @ X3)) @ (esk3_1 @ (kpair @ X1 @ X3)))=(kpair @ X1 @ X3), inference(spm,[status(thm)],[c_0_51, c_0_52])).
0.16/0.42	thf(c_0_54, negated_conjecture, ![X1:$i, X3:$i, X5:$i, X4:$i]:((X1)=(esk3_1 @ (kpair @ X3 @ X4))|(kpair @ X5 @ X1)!=(kpair @ X3 @ X4)), inference(spm,[status(thm)],[c_0_21, c_0_53])).
0.16/0.42	thf(c_0_55, plain, ![X7:$i]:(ksnd @ X7)=(setunion @ (dsetconstr @ (setunion @ X7) @ (epred1_2 @ X7))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ksnd]), c_0_13])).
0.16/0.42	thf(c_0_56, negated_conjecture, ![X2:$i > $o, X1:$i, X3:$i, X4:$i]:(X2 @ X1|(epred1_2 @ (kpair @ X3 @ X4) @ (esk7_3 @ X2 @ X3 @ X4))!=(epred2_2 @ X2 @ (esk7_3 @ X2 @ X3 @ X4))|~in @ X1 @ (setadjoin @ (esk3_1 @ (kpair @ X3 @ X4)) @ emptyset)), inference(neg_ext,[status(thm)],[c_0_38])).
0.16/0.42	thf(c_0_57, negated_conjecture, ![X3:$i, X1:$i]:(in @ (setunion @ X3) @ X3|~in @ X1 @ X3|(X3)!=(setadjoin @ X1 @ emptyset)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_58, negated_conjecture, ![X1:$i, X3:$i]:(esk3_1 @ (kpair @ X1 @ X3))=(X3), inference(er,[status(thm)],[c_0_54])).
0.16/0.42	thf(c_0_59, plain, ![X30:$i]:(ksnd @ X30)=(setunion @ (dsetconstr @ (setunion @ X30) @ (epred1_2 @ X30))), inference(variable_rename,[status(thm)],[c_0_55])).
0.16/0.42	thf(c_0_60, negated_conjecture, ![X2:$i > $o, X1:$i, X4:$i, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk7_3 @ X2 @ X1 @ X3)|epred2_2 @ X2 @ (esk7_3 @ X2 @ X1 @ X3)|X2 @ X4|~in @ X4 @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset)), inference(dynamic cnf,[status(thm)],[c_0_56])).
0.16/0.42	thf(c_0_61, negated_conjecture, ![X1:$i]:(in @ (setunion @ (setadjoin @ X1 @ emptyset)) @ (setadjoin @ X1 @ emptyset)|~in @ X1 @ (setadjoin @ X1 @ emptyset)), inference(er,[status(thm)],[c_0_57])).
0.16/0.42	thf(c_0_62, negated_conjecture, ![X1:$i]:in @ X1 @ (setadjoin @ X1 @ emptyset), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_58]), c_0_58])).
0.16/0.42	thf(c_0_63, plain, ![X1:$i]:(ksnd @ X1)=(setunion @ (dsetconstr @ (setunion @ X1) @ (epred1_2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_59])).
0.16/0.42	thf(c_0_64, negated_conjecture, ![X1:$i, X2:$i > $o, X4:$i, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk7_3 @ X2 @ X1 @ X3)|epred2_2 @ X2 @ (esk7_3 @ X2 @ X1 @ X3)|X2 @ X4|~in @ X4 @ (setadjoin @ X3 @ emptyset)), inference(rw,[status(thm)],[c_0_60, c_0_58])).
0.16/0.42	thf(c_0_65, negated_conjecture, ![X1:$i]:in @ (setunion @ (setadjoin @ X1 @ emptyset)) @ (setadjoin @ X1 @ emptyset), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61, c_0_62])])).
0.16/0.42	thf(c_0_66, negated_conjecture, ![X1:$i, X3:$i]:((setunion @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))=(ksnd @ (kpair @ X1 @ X3))|~in @ X1 @ (setunion @ (kpair @ X1 @ X3))), inference(spm,[status(thm)],[c_0_63, c_0_30])).
0.16/0.42	thf(c_0_67, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk7_3 @ X2 @ X1 @ X3)|X2 @ (setunion @ (setadjoin @ X3 @ emptyset))|epred2_2 @ X2 @ (esk7_3 @ X2 @ X1 @ X3)), inference(spm,[status(thm)],[c_0_64, c_0_65])).
0.16/0.42	thf(c_0_68, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i, X4:$i]:(X2 @ X1|~in @ X1 @ (setadjoin @ (esk3_1 @ (kpair @ X3 @ X4)) @ emptyset)|~epred1_2 @ (kpair @ X3 @ X4) @ (esk7_3 @ X2 @ X3 @ X4)|~epred2_2 @ X2 @ (esk7_3 @ X2 @ X3 @ X4)), inference(dynamic cnf,[status(thm)],[c_0_56])).
0.16/0.42	thf(c_0_69, negated_conjecture, ![X1:$i, X3:$i]:(setunion @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))=(ksnd @ (kpair @ X1 @ X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66, c_0_31]), c_0_32])])).
0.16/0.42	thf(c_0_70, plain, ![X1:$i, X2:$i > $o, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk7_3 @ X2 @ X1 @ X3)|X2 @ (setunion @ (setadjoin @ X3 @ emptyset))|X2 @ (esk7_3 @ X2 @ X1 @ X3)), inference(spm,[status(thm)],[c_0_43, c_0_67])).
0.16/0.42	thf(c_0_71, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:(X2 @ (ksnd @ (kpair @ X1 @ X3))|~epred1_2 @ (kpair @ X1 @ X3) @ (esk7_3 @ X2 @ X1 @ X3)|~epred2_2 @ X2 @ (esk7_3 @ X2 @ X1 @ X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68, c_0_61]), c_0_69]), c_0_39])])).
0.16/0.42	thf(c_0_72, plain, ![X1:$i, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (esk7_3 @ (epred1_2 @ (kpair @ X1 @ X3)) @ X1 @ X3)|epred1_2 @ (kpair @ X1 @ X3) @ (setunion @ (setadjoin @ X3 @ emptyset))), inference(ef,[status(thm)],[c_0_70])).
0.16/0.42	thf(c_0_73, negated_conjecture, ![X1:$i, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (setunion @ (setadjoin @ X3 @ emptyset))|epred1_2 @ (kpair @ X1 @ X3) @ (ksnd @ (kpair @ X1 @ X3))|~epred2_2 @ (epred1_2 @ (kpair @ X1 @ X3)) @ (esk7_3 @ (epred1_2 @ (kpair @ X1 @ X3)) @ X1 @ X3)), inference(spm,[status(thm)],[c_0_71, c_0_72])).
0.16/0.42	thf(c_0_74, negated_conjecture, ![X3:$i, X1:$i]:(setunion @ (setadjoin @ X1 @ emptyset))=(ksnd @ (kpair @ X3 @ X1)), inference(rw,[status(thm)],[c_0_69, c_0_58])).
0.16/0.42	thf(c_0_75, plain, ![X1:$i, X3:$i]:(epred1_2 @ (kpair @ X1 @ X3) @ (setunion @ (setadjoin @ X3 @ emptyset))|epred1_2 @ (kpair @ X1 @ X3) @ (ksnd @ (kpair @ X1 @ X3))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73, c_0_50]), c_0_72])).
0.16/0.42	thf(c_0_76, negated_conjecture, (ksnd @ (kpair @ esk4_0 @ esk5_0))!=(esk5_0), inference(split_conjunct,[status(thm)],[c_0_17])).
0.16/0.42	thf(c_0_77, negated_conjecture, ![X1:$i, X4:$i, X3:$i]:(ksnd @ (kpair @ X1 @ X3))=(ksnd @ (kpair @ X4 @ X3)), inference(spm,[status(thm)],[c_0_74, c_0_74])).
0.16/0.42	thf(c_0_78, negated_conjecture, ![X1:$i, X3:$i]:epred1_2 @ (kpair @ X1 @ X3) @ (setunion @ (setadjoin @ X3 @ emptyset)), inference(spm,[status(thm)],[c_0_75, c_0_74])).
0.16/0.42	thf(c_0_79, negated_conjecture, ![X1:$i]:(ksnd @ (kpair @ X1 @ esk5_0))!=(esk5_0), inference(spm,[status(thm)],[c_0_76, c_0_77])).
0.16/0.42	thf(c_0_80, plain, ![X1:$i, X3:$i]:(kpair @ (kfst @ (kpair @ X1 @ X3)) @ (setunion @ (setadjoin @ X3 @ emptyset)))=(kpair @ X1 @ X3), inference(spm,[status(thm)],[c_0_51, c_0_78])).
0.16/0.42	thf(c_0_81, negated_conjecture, (setunion @ (setadjoin @ esk5_0 @ emptyset))!=(esk5_0), inference(spm,[status(thm)],[c_0_79, c_0_74])).
0.16/0.42	thf(c_0_82, negated_conjecture, ![X1:$i]:(setunion @ (setadjoin @ X1 @ emptyset))=(X1), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_80]), c_0_58])).
0.16/0.42	thf(c_0_83, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81, c_0_82])]), ['proof']).
0.16/0.42	# SZS output end CNFRefutation
0.16/0.42	# Proof object total steps             : 84
0.16/0.42	# Proof object clause steps            : 61
0.16/0.42	# Proof object formula steps           : 23
0.16/0.42	# Proof object conjectures             : 50
0.16/0.42	# Proof object clause conjectures      : 47
0.16/0.42	# Proof object formula conjectures     : 3
0.16/0.42	# Proof object initial clauses used    : 14
0.16/0.42	# Proof object initial formulas used   : 10
0.16/0.42	# Proof object generating inferences   : 27
0.16/0.42	# Proof object simplifying inferences  : 36
0.16/0.42	# Training examples: 0 positive, 0 negative
0.16/0.42	# Parsed axioms                        : 25
0.16/0.42	# Removed by relevancy pruning/SinE    : 0
0.16/0.42	# Initial clauses                      : 30
0.16/0.42	# Removed in clause preprocessing      : 15
0.16/0.42	# Initial clauses in saturation        : 15
0.16/0.42	# Processed clauses                    : 403
0.16/0.42	# ...of these trivial                  : 24
0.16/0.42	# ...subsumed                          : 144
0.16/0.42	# ...remaining for further processing  : 235
0.16/0.42	# Other redundant clauses eliminated   : 6
0.16/0.42	# Clauses deleted for lack of memory   : 0
0.16/0.42	# Backward-subsumed                    : 6
0.16/0.42	# Backward-rewritten                   : 64
0.16/0.42	# Generated clauses                    : 1920
0.16/0.42	# ...of the previous two non-trivial   : 1768
0.16/0.42	# Contextual simplify-reflections      : 3
0.16/0.42	# Paramodulations                      : 1843
0.16/0.42	# Factorizations                       : 24
0.16/0.42	# NegExts                              : 25
0.16/0.42	# Equation resolutions                 : 9
0.16/0.42	# Propositional unsat checks           : 0
0.16/0.42	#    Propositional check models        : 0
0.16/0.42	#    Propositional check unsatisfiable : 0
0.16/0.42	#    Propositional clauses             : 0
0.16/0.42	#    Propositional clauses after purity: 0
0.16/0.42	#    Propositional unsat core size     : 0
0.16/0.42	#    Propositional preprocessing time  : 0.000
0.16/0.42	#    Propositional encoding time       : 0.000
0.16/0.42	#    Propositional solver time         : 0.000
0.16/0.42	#    Success case prop preproc time    : 0.000
0.16/0.42	#    Success case prop encoding time   : 0.000
0.16/0.42	#    Success case prop solver time     : 0.000
0.16/0.42	# Current number of processed clauses  : 139
0.16/0.42	#    Positive orientable unit clauses  : 42
0.16/0.42	#    Positive unorientable unit clauses: 2
0.16/0.42	#    Negative unit clauses             : 2
0.16/0.42	#    Non-unit-clauses                  : 93
0.16/0.42	# Current number of unprocessed clauses: 1312
0.16/0.42	# ...number of literals in the above   : 2292
0.16/0.42	# Current number of archived formulas  : 0
0.16/0.42	# Current number of archived clauses   : 93
0.16/0.42	# Clause-clause subsumption calls (NU) : 3323
0.16/0.42	# Rec. Clause-clause subsumption calls : 2717
0.16/0.42	# Non-unit clause-clause subsumptions  : 128
0.16/0.42	# Unit Clause-clause subsumption calls : 42
0.16/0.42	# Rewrite failures with RHS unbound    : 140
0.16/0.42	# BW rewrite match attempts            : 153
0.16/0.42	# BW rewrite match successes           : 31
0.16/0.42	# Condensation attempts                : 0
0.16/0.42	# Condensation successes               : 0
0.16/0.42	# Termbank termtop insertions          : 611115
0.16/0.42	
0.16/0.42	# -------------------------------------------------
0.16/0.42	# User time                : 0.091 s
0.16/0.42	# System time              : 0.006 s
0.16/0.42	# Total time               : 0.097 s
0.16/0.42	# Maximum resident set size: 1648 pages
0.16/0.42	EOF